package leetcode.string;

import leetcode.number.MaxSubArray;

public class Main {
    public static void main(String[] args) {
        //字符串翻转
        //char[] s = {'h','e','l','l','o'};
        //System.out.println(new StringBuilder().append(s).toString());
        //Reverse.reverseString(s);
        //System.out.println(new StringBuilder().append(s).toString());
        //T9
        //String[] strings = {"tree", "used"};
        //System.out.println(T9.getValidT9Words("8733",strings).toString());
        //strings = new String[]{"a", "b", "c", "d"};
        //System.out.println(T9.getValidT9Words("2",strings).toString());
        //二进制计算
        //String a = "10100000100100110110010000010101111011011001101110111111111101000000101111001110001111100001101";
        //String b = "110101001011101110001111100110001010100001101011101010000011011011001011101111001100000011011110011";
        //a = "100";
        //b = "110010";
        //System.out.println(Binary.addBinary(a,b));
        //System.out.println(Child.strStr("mississippi", "issip"));
        //System.out.println(LongestBeautifulSubstring.longestBeautifulSubstring( "aeiaaioaaaaeiiiiouuuooaauuaeiu"));
        //System.out.println(LongestBeautifulSubstring.longestBeautifulSubstring( "aeeeiiiioooauuuaeiou"));
        //System.out.println(LongestBeautifulSubstring.longestBeautifulSubstring( "a"));
        //System.out.println(LongestBeautifulSubstring.longestBeautifulSubstring( "aeiou"));
        //System.out.println(LongestBeautifulSubstring.longestBeautifulSubstring( "e"));
        //System.out.println(LongestPalindrome.longestPalindrome("ab"));
        //System.out.println(LongestChildString.lengthOfLongestSubstring("aab"));


//        System.out.println(IsValid.isValid("()"));

        int[] nums = {-2,1};
        System.out.println(MaxSubArray.maxSubArray(nums));
    }

}
